On the Numerical Computability of Asteroidal Lyapunov Times
نویسنده
چکیده
To characterize the dynamical stability of an asteroid orbit, the calculation of its Lyapunov-Time TL is a widely used mean in celestial mechanics. In the present work we investigated the effects of the used computer hardware and integration method on the outcome of such stability computations. We showed that for some asteroids the change of the employed numerical method can change the obtained TL significantly. As a result of our investigations we introduced the computability index κ as a measure of repeatability of such computations.
منابع مشابه
Asteroidal number for some product graphs
The notion of Asteroidal triples was introduced by Lekkerkerker and Boland [6]. D.G.Corneil and others [2], Ekkehard Kohler [3] further investigated asteroidal triples. Walter generalized the concept of asteroidal triples to asteroidal sets [8]. Further study was carried out by Haiko Muller [4]. In this paper we find asteroidal numbers for Direct product of cycles, Direct product of path and cy...
متن کاملCorrelation of macroscopic instability and Lyapunov times in the general three-body problem
We conducted extensive numerical experiments of equal mass three-body systems until they became disrupted. The system lifetimes, as a bound triple, and the Lyapunov times show a correlation similar to what has been earlier obtained for small bodies in the Solar System. Numerical integrations of several sets of differently randomised initial conditions produced the same relationship of the insta...
متن کاملThree-body Mean Motion Resonances and the Chaotic Structure of the Asteroid Belt
We discuss the existence and the properties of a new type of mean motion resonance populated by a large number of asteroids, the resonant angle being deÐned as a linear combination (with integer coefficients) of the mean longitudes of asteroid, Jupiter, and Saturn. We call these resonances the threebody mean motion resonances. In the present paper, we show that the anomalous large oscillation o...
متن کاملOn the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
متن کاملThe Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
We analyse the computability and the complexity of various definitions of spectral radii for sets of matrices. We show that the joint and generalized spectral radii of two integer matrices are not approximable in polynomial time, and that two related quantities – the lower spectral radius and the largest Lyapunov exponent – are not algorithmically approximable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008